Online Learning Probabilistic Event Calculus Theories in Answer Set Programming

نویسندگان

چکیده

Abstract Complex Event Recognition (CER) systems detect event occurrences in streaming time-stamped input using predefined patterns. Logic-based approaches are of special interest CER, since, via Statistical Relational AI, they combine uncertainty-resilient reasoning with time and change, machine learning, thus alleviating the cost manual pattern authoring. We present a system based on Answer Set Programming (ASP), capable probabilistic complex patterns form weighted rules Calculus, whose structure weights learnt online. compare our ASP-based implementation Markov one number state-of-the-art batch learning algorithms CER data sets for activity recognition, maritime surveillance fleet management. Our results demonstrate superiority novel approach, both terms efficiency predictive performance. This paper is under consideration publication Theory Practice Logic (TPLP).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circumscriptive Event Calculus as Answer Set Programming

Recently, Ferraris, Lee and Lifschitz presented a general definition of a stable model that is similar to the definition of circumscription, and can even be characterized in terms of circumscription. In this paper, we show the opposite direction, which is, how to turn circumscription into the general stable model semantics, and based on this, how to turn circumscriptive event calculus into answ...

متن کامل

Classical Logic Event Calculus as Answer Set Programming

Recently, Ferraris, Lee and Lifschitz presented a generalized definition of a stable model that applies to the syntax of arbitrary firstorder sentences, under which a logic program is viewed as a special class of first-order sentences. The new definition of a stable model is similar to the definition of circumscription, and can even be characterized in terms of circumscription. In this paper, w...

متن کامل

Situation Calculus as Answer Set Programming

We show how the situation calculus can be reformulated in terms of the first-order stable model semantics. A further transformation into answer set programs allows us to use an answer set solver to perform propositional reasoning about the situation calculus. We also provide an answer set programming style encoding method for Reiter’s basic action theories, which tells us how the solution to th...

متن کامل

Event-Sequence Testing using Answer-Set Programming

In many applications, faults are triggered by events that occur in a particular order. In fact, many bugs are caused by the interaction of only a low number of such events. Based on this assumption, sequence covering arrays (SCAs) have recently been proposed as suitable designs for event sequence testing. In practice, directly applying SCAs for testing is often impaired by additional constraint...

متن کامل

A probabilistic logic programming event calculus

We present a system for recognising human activity given a symbolic representation of video content. The input of our system is a set of time-stamped short-term activities (STA) detected on video frames. The output is a set of recognised long-term activities (LTA), which are pre-defined temporal combinations of STA. The constraints on the STA that, if satisfied, lead to the recognition of a LTA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory and Practice of Logic Programming

سال: 2021

ISSN: ['1471-0684', '1475-3081']

DOI: https://doi.org/10.1017/s1471068421000107